Quantum Simulation Logic, Oracles, and the Quantum Advantage
نویسندگان
چکیده
منابع مشابه
Optical simulation of quantum logic
A constructive method for simulating small-scale quantum circuits by use of linear optical devices is presented. It relies on the representation of several quantum bits by a single photon, and on the implementation of universal quantum gates using simple optical components ~beam splitters, phase shifters, etc.!. This suggests that the optical realization of small quantum networks with present-d...
متن کاملSimulation and Design of an Organic Quantum Film Electrooptic Switch
In this paper the simulation and design of a quantum-film electro-optic switch is considered. This photonic device, is made from a new organic dipolar material called MNA or 2-methyl-4 nitroaniline, which possesses a high merit in comparison with it's inorganic counterparts (e.g. LiNbO3, GaAs, InSb, Quartz, etc). Montecarlo method is used to simulate the photon-it-electron interaction in this m...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملQuantum Computation Relative to Oracles
The study of the power and limitations of quantum computation remains a major challenge in complexity theory. Key questions revolve around the quantum complexity classes EQP, BQP, NQP and their derivatives. This paper presents new relativized worlds in which (i) co-RP * NQE, (ii) P = BQP and UP = EXP, (iii) P = EQP and RP = EXP, and (iv) EQP * Σ 2 ∪Π P 2 . We also show a partial answer to the q...
متن کاملQuantum Identification of Boolean Oracles
The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21080800